On the Non-existence of Product-form Solutions for Queueing Networks with Retrials
نویسنده
چکیده
During the last two decades, several authors have identified several classes of queueing networks (with batch movements, negative customers, signals etc.) that have product-form stationary distributions. On the contrary, there is a very slow progress in the analytic investigation of queueing networks with retrials and there does not exist a single example of such a network with a product-form stationary distribution. In this note we prove the non-existence of product-form solutions for queueing networks with retrials, using a recent characterization of product-form networks.
منابع مشابه
SERIE RE5EHRCH mEmORMlDII PRODUCT FORMS FOR QUEUEING NETWORKS WITH LIMITED CLUSTERS
Queueing networks are considered with limited station clusters. A general characterization is given, in terms of local solutions of state dependent traffic equations, from which the existence and structure of a product form can be concluded. This characterization leads to new product form examples such as with a weak reversible cluster routing or a non-reversible routing both within and in betw...
متن کاملQueueing Systems with
Queueing Systems with Customer Abandonments and Retrials by Song Deng Doctor of Philosophy in Engineering Industrial Engineering & Operations Research University of California, Berkeley Assistant Professor Ying-Ju Chen , Co-chair Professor Zuo-Jun “Max” Shen , Co-chair In queueing theory, the phenomenon that customers get impatient and renege from the system when the waiting time exceeds their ...
متن کاملOn the tra c equations for batch routing queueing networks and stochastic Petri nets
The tra c equations are a set of linear equations, which are the basis for the exact analysis of product form queueing networks, and the approximate analysis of non-product form queueing networks. Conditions characterising the structure of the network that guarantees the existence of a solution for the tra c equations are therefore of great importance. This note provides a necessary and su cien...
متن کاملOn the tra c equations for batch routing queueing networks andstochastic Petri
The traac equations are a set of linear equations, which are the basis for the exact analysis of product form queueing networks, and the approximate analysis of non-product form queueing networks. Conditions characterising the structure of the network that guarantees the existence of a solution for the traac equations are therefore of great importance. This note provides a necessary and suucien...
متن کاملAn Approximation Method for Multi-class Closed Queueing Networks with Synchronization Mechanisms
Queueing networks with synchronization mechanisms are encountered in the modeling and analysis of discrete event systems such as parallel computer systems and computer/communication networks. Exact analytical solutions of such networks are not available. In particular, due to the synchronization mechanisms, these networks do not have a product-form solution. As a result approximation methods th...
متن کامل